Feasible Reductions to Kolmogorov{loveland Stochastic Sequences 1
نویسندگان
چکیده
For every binary sequence A, there is an innnite binary sequence S such that A P tt S and S is stochastic in the sense of Kolmogorov and Loveland.
منابع مشابه
Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences
For every binary sequence A, there is an in nite binary sequence S such that A P tt S and S is stochastic in the sense of Kolmogorov and Loveland.
متن کاملFeasible Reductions to Kolmogorovvloveland Stochastic Sequences 1
For every binary sequence A, there is an in nite binary sequence S such that A P tt S and S is stochastic in the sense of Kolmogorov and Loveland.
متن کاملKolmogorov-Loveland Randomness and Stochasticity
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounded gain in the limit while betting successively on bits of X . A sequence X is KL-stochastic if there is no computable non-monotonic selection rule that selects from X an infinite, biased sequence. One of the major open ...
متن کاملKolmogorov-Loveland Sets and Advice Complexity Classes
Loveland complexity Loveland (1969) is a variant of Kolmogorov complexity, where it is asked to output separately the bits of the desired string, instead of the string itself. Similarly to the resource-bounded Kolmogorov sets we define Loveland sets. We highlight a structural connection between resource-bounded Loveland sets and some advice complexity classes. This structural connection enables...
متن کاملIndependence Properties of Algorithmically Random Sequences
A bounded Kolmogorov-Loveland selection rule is an adaptive strategy for recursively selecting a subsequence of an infinite binary sequence; such a subsequence may be interpreted as the query sequence of a time-bounded Turing machine. In this paper we show that if A is an algorithmically random sequence, A0 is selected from A via a bounded Kolmogorov-Loveland selection rule, and A1 denotes the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999